
import networkx as nx

G1=nx.Graph()

# Net1 AB BE CE CD DE

G1.add_nodes_from(['A', 'B', 'C', 'D', 'E'])
G1.add_edges_from([('A','B'), ('B','E'), ('C','E'), ('C','D'), ('D','E')])
degree_centrality_G1=nx.degree_centrality(G1)
betweenness_centralityG1=nx.betweenness_centrality(G1)

# Net2 AB AE BE CE CD DE

G2=nx.Graph()

G2.add_nodes_from(['A', 'B', 'C', 'D', 'E'])
G2.add_edges_from([('A','B'),('A','E'), ('B','E'), ('C','E'), ('C','D'), ('D','E')])
degree_centrality_G2=nx.degree_centrality(G2)
betweenness_centralityG2=nx.betweenness_centrality(G2)


# Net3 AB BC BE CE CD DE
G3=nx.Graph()
G3.add_nodes_from(['A', 'B', 'C', 'D', 'E'])
G3.add_edges_from([('A','B'),('B','C'), ('B','E'), ('C','E'), ('C','D'), ('D','E')])

degree_centrality_G3=nx.degree_centrality(G3)
betweenness_centralityG3=nx.betweenness_centrality(G3)
